منابع مشابه
Diameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملRadius, diameter, and minimum degree
We give asymptotically sharp upper bounds for the maximum diameter and radius of (i) a connected graph, {ii) a connected trangle-free graph, (iii) a connected C,-free graph with n vertices and with minimum degree 6, where n tends to infinity. Some conjectures for J&-free graphs are also stated. Let G be a connected graph with vertex set V(G) and edge set E(G). For any XJJ E V(G) let dG(x,y) den...
متن کاملApproximate Minimum Diameter
We study the minimum diameter problem for a set of inexact points. By inexact, we mean that the precise location of the points is not known. Instead, the location of each point is restricted to a continues region (Imprecise model) or a finite set of points (Indecisive model). Given a set of inexact points in one of Imprecise or Indecisive models, we wish to provide a lower-bound on the diameter...
متن کاملMinimum Dual Diameter Triangulations∗
Let P be a simple planar polygon with n vertices. We would like to find a triangulation MDT(P) of P that minimizes the diameter of the dual tree. We show that MDT(P) can be constructed in O(n log n) time. If P is convex, we show that the dual of any MDT has diameter 2 · dlog2(n/3)e or 2 · dlog2(n/3)e−1, depending on the value of n. We also investigate the relation between MDT(P) and the number ...
متن کاملMinimum-diameter covering problems
A set V and a collection of (possibly non-disjoint) subsets are given. Also given is a real matrix describing distances between elements of V. A cover is a subset of V containing at least one representative from each subset. The multiple-choice minimum diameter problem is to select a cover of minimum diameter. The diameter is deened as the maximum distance of any pair of elements in the cover. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00197-8